#include <iostream>
#include <utility>

#include "AVL_tree.h"

int main()
{
	qds::AVL_tree<int, int> t;
	//int arr[] = { 5,4,3,2,1,0 };
	//int arr[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	int arr[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
	for (int e : arr)
	{
		t.insert(std::make_pair(e,e));
	}
	t.inorder();
	t.tree_is_balance();
	return 0;
}
